Finite-state concurrent programs can be expressed in pairwise normal form
نویسندگان
چکیده
منابع مشابه
Finite-state concurrent programs can be expressed pairwise
We present a pairwise normal form for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state. This representation has been used to efficiently (in polynomial time) synthesize and model-check correctness properties of concurrent programs. Our main result i...
متن کاملFinite - State Concurrent Systems ?
Temporal logic model checking is an automatic technique for verifying nite-state concurrent systems. Speciications are expressed in a propositional temporal logic, and the concurrent system is modeled as a state-transition graph. An eecient search procedure is used to determine whether or not the state-transition graph sat-isses the speciication. When the technique was rst developed ten years a...
متن کاملSynthesis of Large Concurrent Programs via Pairwise Composition
We present a tractable method for synthesizing arbitrarily large concurrent programs from speciications expressed in temporal logic. Our method does not explicitly construct the global state transition diagram of the program to be synthesized, and thereby avoids state explosion. Instead, it constructs a state transition diagram for each pair of component processes (of the program) that interact...
متن کاملConcurrent and Local Evaluation of Normal Programs
Tabled evaluations can incorporate a number of features, including tabled negation, reduction with respect to the well-founded model, tabled constraints and answer subsumption. Many of these features are most efficiently evaluated using the Local evaluation strategy, which fully evaluates each mutually dependent set of tabled subgoals before returning answers to other subgoals outside of that s...
متن کاملHierarchical Concurrent Finite State Machines in Ptolemy
tics. For example, the co-design finite state machines We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is successfully integrated with synchronous dataflow (SDF) and discrete-event (DE) concurrency domains in Ptolemy. In this heterogeneous combination, the semantics of FSM, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.11.032